Robust Bounding Ellipsoidal Adaptive Constrained least-squares algorithm and its performance analysis
نویسندگان
چکیده
منابع مشابه
Performance Analysis of $l_0$ Norm Constrained Recursive Least Squares Algorithm
Performance analysis of l0 norm constrained Recursive least Squares (RLS) algorithm is attempted in this paper. Though the performance pretty attractive compared to its various alternatives, no thorough study of theoretical analysis has been performed. Like the popular l0 Least Mean Squares (LMS) algorithm, in l0 RLS, a l0 norm penalty is added to provide zero tap attractions on the instantaneo...
متن کاملThe Randomized Ellipsoid Algorithm for Constrained Robust Least Squares Problems
In this chapter a randomized ellipsoid algorithm is described that can be used for finding solutions to robust Linear Matrix Inequality (LMI) problems. The iterative algorithm enjoys the property that the convergence speed is independent on the number of uncertain parameters. Other advantages, as compared to the deterministic algorithms, are that the uncertain parameters can enter the LMIs in a...
متن کاملA robust fast recursive least squares adaptive algorithm
Very often, in the context of system identification, the error signal which is by definition the difference between the system and model filter outputs is assumed to be zero-mean, white, and Gaussian. In this case, the least squares estimator is equivalent to the maximum likelihood estimator and hence, it is asymptotically efficient. While this supposition is very convenient and extremely usefu...
متن کاملStochastic Adaptive Control Using the Robust Least Squares Algorithm
This paper considers properties of the Astrom-Wittenmark self tuning tracker for MIMO systems described with the ARX model. It is supposed that the stochastic noise has the non-Gaussian distribution (condition always present in practice). The consequence of that fact is a nonlinear transformation of the tracking error in the direct adaptive minimum variance controller. The system under consider...
متن کاملAnalysis of a linearly constrained least squares algorithm for adaptive beamforming
DTrj QUXIAJAT flSCFTED 3 The problem of linearly constrained least squares has many applications in signal processing. In this paper, we present a perturbation analysis of a linearly constrrined least squares algorithm for adaptive beaniforming. The perturbation bounds for the solution as well as for the alaest residual element are derived. We also propose an error estimation scheme for the res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Digital Signal Processing
سال: 2016
ISSN: 1051-2004
DOI: 10.1016/j.dsp.2016.01.013